Section: New Results

List decoding

D. Augot, M. Barbier and A. Couvreur wrote on how to decode binary Goppa codes. Augot, Barbier, and Couvreur presented a simple way, with a clean study of the complexity [23] . Using this list decoding algorithm, Barbier and Paulo Barreto proposed a key reduction for the McEliece cryptosystem [25] . The list decoding algorithm above allowed them to add more errors during the McEliece encryption step, making decoding attacks more difficult. At the same complexity of these attacks, using the list decoding algorithm decreases the public key size, which is the main drawback of this cryptosystem.